Exact solution of a minimal recurrenceCHANG, K.-N; TSAI, S.-C.Information processing letters. 2000, Vol 75, Num 1-2, pp 61-64, issn 0020-0190Article

On the balanced divide and conquer equationBATAGELJ, V.International journal of computer mathematics. 1986, Vol 19, Num 3-4, pp 259-266, issn 0020-7160Article

Graph separator algorithms: A refined analysisFERNAU, Henning.Lecture notes in computer science. 2002, pp 186-197, issn 0302-9743, isbn 3-540-00331-2, 12 p.Conference Paper

Task allocation onto a hypercube by recursive mincut bipartitioningERCAL, F; RAMANUJAM, J; SADAYAPPAN, P et al.Journal of parallel and distributed computing (Print). 1990, Vol 10, Num 1, pp 35-44, issn 0743-7315, 10 p.Article

Building executable union slices using conditioned slicingDANICIC, Sebastian; DE LUCIA, Andrea; HARMAN, Mark et al.International Workshop on Program Comprehension. 2004, pp 89-97, isbn 0-7695-2149-5, 1Vol, 9 p.Conference Paper

A divide and conquer algorithm for computing singular valuesCHANDRASEKARAN, S; IPSEN, I. C. F.Zeitschrift für angewandte Mathematik und Mechanik. 1994, Vol 74, Num 6, pp T532-T534, issn 0044-2267Article

A parallel multistage method for surface/surface intersectionBÜRGER, H; SCHABACK, R.Computer aided geometric design. 1993, Vol 10, Num 3-4, pp 277-291, issn 0167-8396Conference Paper

Solution of a divide-and-conquer maximin recurrenceZHIYUAN LI; REINGOLD, E. M.SIAM journal on computing (Print). 1989, Vol 18, Num 6, pp 1188-1200, issn 0097-5397Article

MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple MoleculesHARIHARAN, Ramesh; JANAKIRAMAN, Anand; NILAKANTAN, Ramaswamy et al.Journal of chemical information and modeling. 2011, Vol 51, Num 4, pp 788-806, issn 1549-9596, 19 p.Article

A lambda-calculus with constructorsARBISER, Ariel; MIQUEL, Alexandre; RIOS, Alejandro et al.Lecture notes in computer science. 2006, pp 181-196, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 16 p.Conference Paper

Abstract modularityABBOTT, Michael; GHANI, Neil; LÜTH, Christoph et al.Lecture notes in computer science. 2005, pp 46-60, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

DeWall : A fast divide and conquer Delaunay triangulation algorithm in E^dCIGNONI, P; MONTANI, C; SCOPIGNO, R et al.Computer-aided design. 1998, Vol 30, Num 5, pp 333-341, issn 0010-4485Article

Applications of a strategy for designing divide-and-conquer algorithmsSMITH, D. R; DARLINGTON, J.Science of computer programming. 1987, Vol 8, Num 3, pp 213-229, issn 0167-6423Article

Modeling and analysis of worm and killer-worm propagation using the divide-and-conquer strategyDAN WU; DONGYANG LONG; CHANGJI WANG et al.Lecture notes in computer science. 2005, pp 370-375, issn 0302-9743, isbn 3-540-29235-7, 1Vol, 6 p.Conference Paper

A lazy divide & conquer approach to constraint solvingANAND, Saswat; WEI-NGAN CHIN; SIAU-CHENG KHOO et al.Proceedings - International Conference on Tools with Artificial Intelligence, TAI. 2002, pp 91-98, issn 1082-3409, isbn 0-7695-1849-4, 8 p.Conference Paper

Balanced k-coloringsBIEDL, T. C; CENEK, E; CHAN, T. M et al.Lecture notes in computer science. 2000, pp 202-211, issn 0302-9743, isbn 3-540-67901-4Conference Paper

Minimizing global communication in parallel list rankingSIBEYN, Jop F.Lecture notes in computer science. 2003, pp 894-902, issn 0302-9743, isbn 3-540-40788-X, 9 p.Conference Paper

Divide-and-conquer algorithm for computing set containment joinsMELNIK, Sergey; GARCIA-MOLINA, Hector.Lecture notes in computer science. 2002, pp 427-444, issn 0302-9743, isbn 3-540-43324-4Conference Paper

Deriving algorithms on reconfigurable networks based on function decompositionGEN-HUEY CHEN; BIING-FENG WANG; HUNGWEN LI et al.Theoretical computer science. 1993, Vol 120, Num 2, pp 215-227, issn 0304-3975Article

Graph separation techniques for quadratic zero-one programmingPARDALOS, P. M; SOMESH JHA.Computers & mathematics with applications (1987). 1991, Vol 21, Num 6-7, pp 107-113, issn 0898-1221Article

A tutorial on efficient computer graphic representations of the Mandelbrot setROJAS, R.Computers & graphics. 1991, Vol 15, Num 1, pp 91-100, issn 0097-8493, 10 p.Article

Maximum independent set for intervals by divide and conquer with pruningSNOEYINK, Jack.Networks (New York, NY). 2007, Vol 49, Num 2, pp 158-159, issn 0028-3045, 2 p.Article

Divide and conquer: Genetic programming based on multiple Branches encodingRODRIGUEZ-VAZQUEZ, Katya; OLIVER-MORALES, Carlos.Lecture notes in computer science. 2003, pp 218-228, issn 0302-9743, isbn 3-540-00971-X, 11 p.Conference Paper

Distributed proxy: A design pattern for the incremental development of distributed applicationsRITO SILVA, Antonio; ASSIS ROSA, Francisco; GONCALVES, Teresa et al.Lecture notes in computer science. 2001, pp 165-181, issn 0302-9743, isbn 3-540-41792-3Conference Paper

Ahnentafel indexing into morton-ordered arrays, or matrix locality for freeWISE, D. S.Lecture notes in computer science. 2000, pp 774-783, issn 0302-9743, isbn 3-540-67956-1Conference Paper